Interleaving Execution and Planning via Symbolic Model Checking
نویسندگان
چکیده
Interleaving planning and execution is the practical alternative to the problem of planning off-line with large state spaces. While planning via symbolic model checking has been extensively studied for off-line planning, no framework for interleaving it with execution has been ever devised. In this paper, we extend planning via symbolic model checking with the ability of interleaving planning and execution in the case of nondeterministic domains and partial observability, one of the most challenging and complex planning problems. We build a planning algorithm such that the interleaving of planning and execution is guaranteed to terminate, either because the goal is achieved, or since there is no longer chance to find a plan leading to the goal. We experiment with the planner and show that it can solve planning problems that cannot be tackled by the off-line symbolic model checking techniques.
منابع مشابه
Symbolic Model Checking for Asynchronous Boolean Programs
Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effec...
متن کاملTesting the IPC Protocol for a Real-Time Operating System
In this paper, we adapt model-based testing techniques to concurrent code, namely for test generations of an (industrial) OS kernel called PikeOS. Since our data-models are complex, the problem is out of reach of conventional model-checking techniques. Our solution is based on symbolic execution implemented inside the interactive theorem proving environment Isabelle/HOL extended by a plugin wit...
متن کاملScalable Asynchronous Hardware Protocol Verification for Compositions with Relative Timing
Correct interaction of asynchronous hardware protocols requires verification. Performance and power of asynchronous hardware circuits and protocols can be vastly improved by modifying them with judicious application of timing constraints. A methodology is presented for verifying larger asynchronous protocols through compositional model checking with symbolic methods. This approach uses Relative...
متن کاملConformance Checking of Real-Time Models - Symbolic Execution vs. Bounded Model Checking
Abstract. We compare conformance checking based on symbolic execution to conformance checking via bounded model checking. The application context is fault-based test case generation, focusing on realtime faults. The existing bounded model checking approach is performed on timed automata. It supports time-relevant mutation operators and a preprocessing functionality for removing silent transitio...
متن کامل